Khmer Treebank Construction via Interactive Tree Visualization
نویسندگان
چکیده
منابع مشابه
Interactive, Tree-Based Graph Visualization
We introduce an interactive graph visualization scheme that allows users to explore graphs by viewing them as a sequence of spanning trees, rather than the entire graph all at once. The user determines which spanning trees are displayed by selecting a vertex from the graph to be the root. Our main contributions are a graph drawing algorithm that generates meaningful representations of graphs us...
متن کاملA Compact Interactive Visualization of Dependency Treebank Query Results
One of the challenges of corpus querying is making sense of the results of a query, especially when a large number of results and linguistically annotated data are concerned. While the most widespread tools for querying syntactically annotated corpora tend to focus on single occurrences, one aspect that is not fully exploited yet in this area is that language is a complex system whose units are...
متن کاملMeshFlow: interactive visualization of mesh construction sequences
The construction of polygonal meshes remains a complex task in Computer Graphics, taking tens of thousands of individual operations over several hours of modeling time. The complexity of modeling in terms of number of operations and time makes it difficult for artists to understand all details of how meshes are constructed. We present MeshFlow, an interactive system for visualizing mesh constru...
متن کاملMultilevel Compound Tree - Construction Visualization and Interaction
Several hierarchical clustering techniques have been proposed to visualize large graphs, but fewer solutions suggest a focus based approach. We propose a multilevel clustering technique that produces in linear time a contextual clustered view depending on a user-focus. We get a tree of clusters where each cluster called meta-silhouette is itself hierarchically clustered into an inclusion tree o...
متن کاملClustering Via Decision Tree Construction
Clustering is an exploratory data analysis task. It aims to find the intrinsic structure of data by organizing data objects into similarity groups or clusters. It is often called unsupervised learning because no class labels denoting an a priori partition of the objects are given. This is in contrast with supervised learning (e.g., classification) for which the data objects are already labeled ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IJITEE (International Journal of Information Technology and Electrical Engineering)
سال: 2019
ISSN: 2550-0554
DOI: 10.22146/ijitee.48545